Lazy Susan: dumb waiting as proof of work
نویسندگان
چکیده
The open nature of Internet services has been of great value to users, enabling dramatic innovation and evolution of services. However, this openness permits many abuses of open-access Internet services such as web, email, and DNS. To counteract such abuses, a number of so called proof-of-work schemes have been proposed. They aim to prevent or limit such abuses by demanding potential clients of the service to prove that they have carried out some amount of work before they will be served. In this paper we show that existing resource-based schemes have several problems, and instead propose latency-based proof-of-work as a solution. We describe centralised and distributed variants, introducing the problem class of non-parallelisable shared secrets in the process. We also discuss application of this technique at the network layer as a way to prevent Internet distributed denial-of-service attacks.
منابع مشابه
The adequacy of Launchbury's natural semantics for lazy evaluation
In his seminal paper “A Natural Semantics for Lazy Evaluation”, John Launchbury proves his semantics correct with respect to a denotational semantics, and outlines a proof of adequacy. Previous attempts to rigorize the adequacy proof, which involves an intermediate natural semantics and an intermediate resourced denotational semantics, have failed. We devised a new, direct proof that skips the ...
متن کاملShallow Lazy Proofs
We show that delaying fully-expansive proof reconstruction for non-interactive decision procedures can result in a more efficient workflow. In contrast with earlier work, our approach to postponed proof does not require making deep changes to the theorem prover.
متن کاملThesis Proposal: A Theory of Lazy Time and Space
We propose a thesis on our theory of lazy time and space. It will be along the line of: 1. (Introduction) The convenience of lazy evaluation in programming and the problem of predicting time and space costs of lazy programs. Previous work on this front. 2. (Background) Hehner’s theory of programming, on which our theory of lazy time and space will be built as an add-on, at least at the onset. 3...
متن کاملType-Based Allocation Analysis for Co-recursion in Lazy Functional Languages
This paper presents a novel type-and-effect analysis for predicting upper-bounds on memory allocation costs for co-recursive definitions in a simple lazily-evaluated functional language. We show the soundness of this system against an instrumented variant of Launchbury’s semantics for lazy evaluation which serves as a formal cost model. Our soundness proof requires an intermediate semantics emp...
متن کاملA Single-Step Term-Graph Reduction System for Proof Assistants
In this paper, we will define a custom term-graph reduction system for a simplified lazy functional language. Our custom system is geared towards flexibility, which is accomplished by leaving the choice of redex free and by making use of single-step reduction. It is therefore more suited for formal reasoning than the well-established standard reduction systems, which usually fix a single redex ...
متن کامل